TSTP Solution File: QUA016^1 by cvc5---1.0.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : QUA016^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 13:31:31 EDT 2023

% Result   : Timeout 299.90s 300.20s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : QUA016^1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.12  % Command    : do_cvc5 %s %d
% 0.11/0.32  % Computer : n020.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Sat Aug 26 16:40:44 EDT 2023
% 0.11/0.32  % CPUTime    : 
% 0.16/0.44  %----Proving TH0
% 0.16/0.44  %------------------------------------------------------------------------------
% 0.16/0.44  % File     : QUA016^1 : TPTP v8.1.2. Released v4.1.0.
% 0.16/0.44  % Domain   : Quantales
% 0.16/0.44  % Problem  : Isotony with respect to addition
% 0.16/0.44  % Version  : [Hoe09] axioms.
% 0.16/0.44  % English  :
% 0.16/0.44  
% 0.16/0.44  % Refs     : [Con71] Conway (1971), Regular Algebra and Finite Machines
% 0.16/0.44  %          : [Hoe09] Hoefner (2009), Email to Geoff Sutcliffe
% 0.16/0.44  % Source   : [Hoe09]
% 0.16/0.44  % Names    : QUA16 [Hoe09] 
% 0.16/0.44  
% 0.16/0.44  % Status   : Theorem
% 0.16/0.44  % Rating   : 1.00 v4.1.0
% 0.16/0.44  % Syntax   : Number of formulae    :   27 (  13 unt;  12 typ;   7 def)
% 0.16/0.44  %            Number of atoms       :   52 (  17 equ;   0 cnn)
% 0.16/0.44  %            Maximal formula atoms :    8 (   3 avg)
% 0.16/0.44  %            Number of connectives :   56 (   0   ~;   1   |;   4   &;  49   @)
% 0.16/0.44  %                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
% 0.16/0.44  %            Maximal formula depth :   10 (   2 avg)
% 0.16/0.44  %            Number of types       :    2 (   0 usr)
% 0.16/0.44  %            Number of type conns  :   45 (  45   >;   0   *;   0   +;   0  <<)
% 0.16/0.44  %            Number of symbols     :   17 (  15 usr;   6 con; 0-3 aty)
% 0.16/0.44  %            Number of variables   :   30 (  15   ^;  11   !;   4   ?;  30   :)
% 0.16/0.44  % SPC      : TH0_THM_EQU_NAR
% 0.16/0.44  
% 0.16/0.44  % Comments : 
% 0.16/0.44  %------------------------------------------------------------------------------
% 0.16/0.44  %----Include axioms for Quantales
% 0.16/0.44  %------------------------------------------------------------------------------
% 0.16/0.44  %----Usual Definition of Set Theory
% 0.16/0.44  thf(emptyset_type,type,
% 0.16/0.44      emptyset: $i > $o ).
% 0.16/0.44  
% 0.16/0.44  thf(emptyset_def,definition,
% 0.16/0.44      ( emptyset
% 0.16/0.44      = ( ^ [X: $i] : $false ) ) ).
% 0.16/0.44  
% 0.16/0.44  thf(union_type,type,
% 0.16/0.44      union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.16/0.44  
% 0.16/0.44  thf(union_def,definition,
% 0.16/0.44      ( union
% 0.16/0.44      = ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
% 0.16/0.44            ( ( X @ U )
% 0.16/0.44            | ( Y @ U ) ) ) ) ).
% 0.16/0.44  
% 0.16/0.44  thf(singleton_type,type,
% 0.16/0.44      singleton: $i > $i > $o ).
% 0.16/0.44  
% 0.16/0.44  thf(singleton_def,definition,
% 0.16/0.44      ( singleton
% 0.16/0.44      = ( ^ [X: $i,U: $i] : ( U = X ) ) ) ).
% 0.16/0.44  
% 0.16/0.44  %----Supremum Definition
% 0.16/0.44  thf(zero_type,type,
% 0.16/0.44      zero: $i ).
% 0.16/0.44  
% 0.16/0.44  thf(sup_type,type,
% 0.16/0.44      sup: ( $i > $o ) > $i ).
% 0.16/0.44  
% 0.16/0.44  thf(sup_es,axiom,
% 0.16/0.44      ( ( sup @ emptyset )
% 0.16/0.44      = zero ) ).
% 0.16/0.44  
% 0.16/0.44  thf(sup_singleset,axiom,
% 0.16/0.44      ! [X: $i] :
% 0.16/0.44        ( ( sup @ ( singleton @ X ) )
% 0.16/0.44        = X ) ).
% 0.16/0.44  
% 0.16/0.44  thf(supset_type,type,
% 0.16/0.44      supset: ( ( $i > $o ) > $o ) > $i > $o ).
% 0.16/0.44  
% 0.16/0.44  thf(supset,definition,
% 0.16/0.44      ( supset
% 0.16/0.44      = ( ^ [F: ( $i > $o ) > $o,X: $i] :
% 0.16/0.44          ? [Y: $i > $o] :
% 0.16/0.44            ( ( F @ Y )
% 0.16/0.44            & ( ( sup @ Y )
% 0.16/0.44              = X ) ) ) ) ).
% 0.16/0.44  
% 0.16/0.44  thf(unionset_type,type,
% 0.16/0.44      unionset: ( ( $i > $o ) > $o ) > $i > $o ).
% 0.16/0.44  
% 0.16/0.44  thf(unionset,definition,
% 0.16/0.44      ( unionset
% 0.16/0.44      = ( ^ [F: ( $i > $o ) > $o,X: $i] :
% 0.16/0.44          ? [Y: $i > $o] :
% 0.16/0.44            ( ( F @ Y )
% 0.16/0.44            & ( Y @ X ) ) ) ) ).
% 0.16/0.44  
% 0.16/0.44  thf(sup_set,axiom,
% 0.16/0.44      ! [X: ( $i > $o ) > $o] :
% 0.16/0.44        ( ( sup @ ( supset @ X ) )
% 0.16/0.44        = ( sup @ ( unionset @ X ) ) ) ).
% 0.16/0.44  
% 0.16/0.44  %----Definition of binary sums and lattice order
% 0.16/0.44  thf(addition_type,type,
% 0.16/0.44      addition: $i > $i > $i ).
% 0.16/0.44  
% 0.16/0.44  thf(addition_def,definition,
% 0.16/0.44      ( addition
% 0.16/0.44      = ( ^ [X: $i,Y: $i] : ( sup @ ( union @ ( singleton @ X ) @ ( singleton @ Y ) ) ) ) ) ).
% 0.16/0.44  
% 0.16/0.44  thf(order_type,type,
% 0.16/0.44      leq: $i > $i > $o ).
% 0.16/0.44  
% 0.16/0.44  thf(order_def,axiom,
% 0.16/0.44      ! [X1: $i,X2: $i] :
% 0.16/0.44        ( ( leq @ X1 @ X2 )
% 0.16/0.44      <=> ( ( addition @ X1 @ X2 )
% 0.16/0.44          = X2 ) ) ).
% 0.16/0.44  
% 0.16/0.44  %----Definition of multiplication
% 0.16/0.44  thf(multiplication_type,type,
% 0.16/0.44      multiplication: $i > $i > $i ).
% 0.16/0.44  
% 0.16/0.44  thf(crossmult_type,type,
% 0.16/0.44      crossmult: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.16/0.44  
% 0.16/0.44  thf(crossmult_def,definition,
% 0.16/0.44      ( crossmult
% 0.16/0.44      = ( ^ [X: $i > $o,Y: $i > $o,A: $i] :
% 0.16/0.44          ? [X1: $i,Y1: $i] :
% 0.16/0.44            ( ( X @ X1 )
% 0.16/0.44            & ( Y @ Y1 )
% 0.16/0.44            & ( A
% 0.16/0.44              = ( multiplication @ X1 @ Y1 ) ) ) ) ) ).
% 0.16/0.44  
% 0.16/0.44  thf(multiplication_def,axiom,
% 0.16/0.44      ! [X: $i > $o,Y: $i > $o] :
% 0.16/0.44        ( ( multiplication @ ( sup @ X ) @ ( sup @ Y ) )
% 0.16/0.44        = ( sup @ ( crossmult @ X @ Y ) ) ) ).
% 0.16/0.44  
% 0.16/0.44  thf(one_type,type,
% 0.16/0.44      one: $i ).
% 0.16/0.44  
% 0.16/0.44  thf(multiplication_neutral_right,axiom,
% 0.16/0.44      ! [X: $i] :
% 0.16/0.44        ( ( multiplication @ X @ one )
% 0.16/0.44        = X ) ).
% 0.16/0.44  
% 0.16/0.44  thf(multiplication_neutral_left,axiom,
% 0.16/0.44      ! [X: $i] :
% 0.16/0.44        ( ( multiplication @ one @ X )
% 0.16/0.44        = X ) ).
% 0.16/0.44  
% 0.16/0.44  %------------------------------------------------------------------------/export/starexec/sandbox2/solver/bin/do_THM_THF: line 35:  5694 Alarm clock             ( read result; case "$result" in 
% 299.90/300.20      unsat)
% 299.90/300.20          echo "% SZS status $unsatResult for $tptpfilename"; echo "% SZS output start Proof for $tptpfilename"; cat; echo "% SZS output end Proof for $tptpfilename"; exit 0
% 299.90/300.20      ;;
% 299.90/300.20      sat)
% 299.90/300.20          echo "% SZS status $satResult for $tptpfilename"; cat; exit 0
% 299.90/300.20      ;;
% 299.90/300.20  esac; exit 1 )
% 299.90/300.21  Alarm clock 
% 299.90/300.21  % cvc5---1.0.5 exiting
% 299.90/300.21  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------